Greedy Compositional Clustering for Unsupervised Learning of Hierarchical Compositional Models

نویسندگان

  • Adam Kortylewski
  • Clemens Blumer
  • Thomas Vetter
چکیده

This paper proposes to integrate a feature pursuit learning process into a greedy bottom-up learning scheme. The algorithm combines the benefits of bottom-up and top-down approaches for learning hierarchical models: It allows to induce the hierarchical structure of objects in an unsupervised manner, while avoiding a hard decision on the activation of parts. We follow the principle of compositionality by assembling higher-order parts from elements of lower layers in the hierarchy. The parts are learned greedily with an EM-type process that iterates between image encoding and part re-learning. The process stops when a candidate part is not able to find a free niche in the image. The algorithm proceeds layer by layer in a bottom-up manner until no further compositions are found. A subsequent top-down process composes the learned hierarchical shape vocabulary into a holistic object model. Experimental evaluation of the approach shows state-of-the-art performance on a domain adaptation task. Moreover, we demonstrate the capability of learning complex, semantically meaningful hierarchical compositional models without supervision.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Unsupervised Structure Learning: Hierarchical Recursive Composition, Suspicious Coincidence and Competitive Exclusion

We describe a new method for unsupervised structure learning of a hierarchical compositional model (HCM) for deformable objects. The learning is unsupervised in the sense that we are given a training dataset of images containing the object in cluttered backgrounds but we do not know the position or boundary of the object. The structure learning is performed by a bottom-up and top-down process. ...

متن کامل

High-Dimensional Unsupervised Active Learning Method

In this work, a hierarchical ensemble of projected clustering algorithm for high-dimensional data is proposed. The basic concept of the algorithm is based on the active learning method (ALM) which is a fuzzy learning scheme, inspired by some behavioral features of human brain functionality. High-dimensional unsupervised active learning method (HUALM) is a clustering algorithm which blurs the da...

متن کامل

On-Line Learning of Predictive Compositional Hierarchies by Hebbian Chunking

I have investigated systems for on-line, cumulative learning of compositional hierarchies embedded within predictive probabilistic models. The hierarchies are learned unsupervised from unsegmented data streams. Such learning is critical for long-lived intelligent agents in complex worlds. Learned patterns enable prediction of unseen data and serve as building blocks for higherlevel knowledge re...

متن کامل

SymCHM—An Unsupervised Approach for Pattern Discovery in Symbolic Music with a Compositional Hierarchical Model

This paper presents a compositional hierarchical model for pattern discovery in symbolic music. The model can be regarded as a deep architecture with a transparent structure. It can learn a set of repeated patterns within individual works or larger corpora in an unsupervised manner, relying on statistics of pattern occurrences, and robustly infer the learned patterns in new, unknown works. A le...

متن کامل

Probabilistic Compositional Active Basis Models for Robust Pattern Recognition

Hierarchical compositional models (HCMs) have shown impressive generalisation capabilities, especially compared to the small amounts of data needed for training. However, regarding occlusion and other non-linear pattern distortions, experimental setups have been controlled so far. In this work, we study the robustness of HCMs under such more challenging pattern recognition conditions. Our contr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1701.06171  شماره 

صفحات  -

تاریخ انتشار 2017